package algorithm.heap;

/**
 * @author bingo
 * @create 2018-02-25 10:10
 **/
public class Test {
   private  Integer[] a= new Integer[10];
   public void test1(){

       Integer[] demo    = new Integer[10];

       for(int i=0;i<10;i++){
           demo[i]=i;
       }

       for(int i=0;i<10;i++){
           if(i==9){

               break;
           }
           System.out.println(demo[i]>demo[i+1]);
       }



   }


   public static void main(String[] args) {
      Test test = new Test();
      test.test1();
   }





}
